Model Predictive Control of Priced Timed Automata Encoded With First-Order Logic

نویسندگان

چکیده

Priced timed automata (PTA) are discrete-event system models with temporal constraints and a cost function used to pose optimal scheduling routing problems. To date, solutions these problems have been found offline executed open loop.This open-loop control strategy makes it impossible account for disturbances, i.e., changes in costs or over time. address this shortcoming, work’s first contribution is closed-loop model predictive (MPC) framework PTA, enabling decision-making based on real-time updates. ensure the feasibility of an MPC problem, often desirable soften constraints. However, contemporary PTA theory does not consider soft Thus, second integrate constraint softening by harnessing capabilities new solvers enabled recasting problem into first-order logic employing modified encoding schemes existing works. Finally, proposed implementation demonstrated simulation case study guidance product through manufacturing system.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model-Checking One-Clock Priced Timed Automata

We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class ...

متن کامل

Priced Timed Automata: Theory & Tools

Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)decidability results related to priced timed automata as well as point to a number of open problems.

متن کامل

Decidable Veriication for Reducible Timed Automata Speciied in a First Order Logic with Time. Decidable Veriication for Reducible Timed Automata Speciied in a First Order Logic with Time

We consider the veriication problem for timed programs which requirements speciication is given in a rst order logic with explicit time (that is in a rather general setting), and program speciication is represented by a timed automaton. We formalize an observation concerning some practical systems of control which is related to their ""niteness". Algorithm of control often memorizes and uses on...

متن کامل

Concavely-Priced Probabilistic Timed Automata

Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-com...

متن کامل

Statistical Model Checking for Networks of Priced Timed Automata

This paper offers a natural stochastic semantics of Networks of Priced Timed Automata (NPTA) based on races between components. The semantics provides the basis for satisfaction of Probabilistic Weighted CTL properties (PWCTL), conservatively extending the classical satisfaction of timed automata with respect to TCTL. In particular the extension allows for hard real-time properties of timed aut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Control Systems and Technology

سال: 2022

ISSN: ['1558-0865', '2374-0159', '1063-6536']

DOI: https://doi.org/10.1109/tcst.2021.3054800